Recurrence and algorithmic information

In this paper we initiate a somewhat detailed investigation of the relationships between quantitative recurrence indicators and algorithmic complexity of orbits in weakly chaotic dynamical systems. We mainly focus on examples.Comment: 26 pages, no figure

Infinite ergodic theory and Non-extensive entropies

We bring into account a series of result in the infinite ergodic theory that we believe that they are relevant to the theory of non-extensive entropie

Information of sequences and applications

In this short note, we outline some results about complexity of orbits of a dynamical system, entropy and initial condition sensitivity in weakly chaotic dynamical systems. We present a technique to estimate orbit complexity by the use of data compression algorithms. We also outline how this technique has been applied by our research group to dynamical systems and to DNA sequences